Experiments in Mutual Exclusion Bootstrapping
نویسندگان
چکیده
Mutual Exclusion Bootstrapping (MEB) was designed to overcome the problem of semantic drift suffered by iterative bootstrapping, where the meaning of extracted terms quickly drifts from the original seed terms (Curran et al., 2007). MEB works by extracting mutually exclusive classes in parallel which constrain each other. In this paper we explore the strengths and limitations of MEB by applying it to two novel lexical-semantic extraction tasks: extracting bigram named entities and WordNet lexical file classes (Fellbaum, 1998) from the Google Web 1T 5-grams.
منابع مشابه
Minimising semantic drift with Mutual Exclusion Bootstrapping
Iterative bootstrapping techniques are commonly used to extract lexical semantic resources from raw text. Their major weakness is that, without costly human intervention, the extracted terms (often rapidly) drift from the meaning of the original seed terms. In this paper we proposeMutual Exclusion bootstrapping (MEB) in which multiple semantic classes compete for each extracted term. This signi...
متن کاملWeighted Mutual Exclusion Bootstrapping for Domain Independent Lexicon and Template Acquisition
We present the Weighted Mutual Exclusion Bootstrapping (WMEB) algorithm for simultaneously extracting precise semantic lexicons and templates for multiple categories. WMEB is capable of extracting larger lexicons with higher precision than previous techniques, successfully reducing semantic drift by incorporating new weighting functions and a cumulative template pool while still enforcing mutua...
متن کاملAn Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm
Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...
متن کاملIJCAI - 99 1 Temporal Planning with Mutual Exclusion Reasoning
Many planning domains require a richer notion of time in which actions can overlap and have di erent durations. The key to fast performance in classical planners (e.g., Graphplan, ipp, and Blackbox) has been the use of a disjunctive representation with powerful mutual exclusion reasoning. This paper presents tgp, a new algorithm for temporal planning. tgp operates by incrementally expanding a c...
متن کاملTemporal Planning with Mutual Exclusion Reasoning
Many planning domains require a richer notion of time in which actions can overlap and have di erent durations. The key to fast performance in classical planners (e.g., Graphplan, ipp, and Blackbox) has been the use of a disjunctive representation with powerful mutual exclusion reasoning. This paper presents tgp, a new algorithm for temporal planning. tgp operates by incrementally expanding a c...
متن کامل